Conditional Schedules for Processes with Temporal Constraints
نویسندگان
چکیده
منابع مشابه
Two-stage dynamic optimisation of service processes with temporal constraints
In order to guarantee the successful execution of service processes in cloud computing, it is important to dynamically optimise service processes with temporal constraints at runtime. Recently, there exist some works related to this issue. However, they cannot adapt to mixture distributed situations where distributions of service durations are complex and diverse, and they seldom consider the a...
متن کاملPeriodic schedules for linear precedence constraints
We consider the computation of periodic cyclic schedules for linear precedence constraints graph: a linear precedence constraint is defined between two tasks and induces an infinite set of usual precedence constraints between their executions such the the difference of iterations is a linear function.The objective function is the minimization of the maximal period of a task. Firstly, we recall ...
متن کاملA Model for Interactive Scores with Temporal Constraints and Conditional Branching
Interactive Scores (IS) are a formalism for the design and performance of interactive multimedia scenarios. IS provide temporal relations (TR), but they cannot represent conditional branching and TRs simultaneously. We propose an extension to Allombert et al.’s IS model by including a condition on the TRs. We found out that in order to have a coherent model in all possible scenarios, durations ...
متن کاملEntailment with Conditional Equality Constraints
Equality constraints (unification constraints) have widespread use in program analysis, most notably in static polymorphic type systems. Conditional equality constraints extend equality constraints with a weak form of subtyping to allow for more accurate analyses. We give a complete complexity characterization of the various entailment problems for conditional equality constraints. Additionally...
متن کاملA Calculus for Concurrent Processes with Constraints
The -calculus is a formal model of concurrent computation based on the notion of naming. It has an important role to play in the search for more abstract theories of concurrent and communicating systems. In this paper we augment the -calculus with a constraint store and add the notion of constraint agent to the standard -calculus concept of agent. We call this extension the -calculus. We also e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SN Computer Science
سال: 2020
ISSN: 2662-995X,2661-8907
DOI: 10.1007/s42979-020-00242-8